Research on bin packing problem based on improved immune clonal algorithm
نویسندگان
چکیده
An improved immune cloning algorithm based on clustering competition is proposed, which ensures the diversity of antibody population, effectively improves convergence speed and avoids immature convergence. The applied to packing problem achieves good results.
منابع مشابه
Analysis of STAGE Algorithm Based on Solving Bin Packing Problem
Previous researches have shown the success of using Reinforcement Learning in solving combinatorial optimization problems. The main idea of these methods is to learn (near) optimal evaluation functions to improve local searches and find (near) optimal solutions. STAGE algorithm, introduced by Boyan & Moore, is one of the most important algorithms in this area. In this paper, we focus on Bin-Pac...
متن کاملAn Improved Algorithm for Optimal Bin Packing
Given a set of numbers, and a set of bins of fixed capacity, the NP-complete problem of bin packing is to find the minimum number of bins needed to contain the numbers, such that the sum of the numbers assigned to each bin does not exceed the bin capacity. We present two improvements to our previous bin-completion algorithm. The first speeds up the constant factor per node generation, and the s...
متن کاملImproved Results on Online Dynamic Bin Packing
Bin packing is an NP-hard [10] classical combinatorial optimization problem. The objective is to pack a set of items into a minimum number of unit-size bins such that the total size of the items in a bin does not exceed the bin capacity. The problem has been studied extensively both in the offline and online settings [7, 8, 5]. In the online setting [11, 12], items may arrive at arbitrary time;...
متن کاملEvolutionary Algorithm for Bin Packing Problem
In this paper we investigate the use of evolution strategy (ES) for the bin packing problem. We used (1, λ)-ES, where 10 children are generated from one parent by means of a simple genetic operators; the crossover is not applied. The best of the descendants becomes the new parent solution. A widely known ordering representation modified for the purposes of the grouping the objects was used in t...
متن کاملOn a Constrained Bin-packing Problem
We study a bin-packing problem which is one-dimensional and is constrained in the manner items are placed into bins. The problem is motivated by a practical realtime scheduling problem, where redundant periodic tasks need to be assigned to a multiprocessor system. The problem is stated in the traditional light: to use as few bins as possible to pack a given list of items, and it is a generaliza...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SHS web of conferences
سال: 2022
ISSN: ['2261-2424', '2416-5182']
DOI: https://doi.org/10.1051/shsconf/202214001041